Inferring efficient weights from pairwise comparison
نویسندگان
چکیده
Several Multi-Criteria-Decision-Making methodologies assume the existence of weights associated with the different criteria, reflecting their relative importance. One of the most popular ways to infer such weights is the Analytic Hierarchy Process, which constructs first a matrix of pairwise comparisons, from which weights are derived following one out of many existing procedures, such as the eigenvector method or the least (logarithmic) squares. Since different procedures yield different results (weights) we pose the problem of describing the set of weights obtained by ”sensible” methods: those which are efficient for the (vector-) optimization problem of simultaneous minimization of discrepancies. A characterization of the set of efficient solutions is given, which enables us to assert that the least-logarithmic-squares solution is always efficient, whereas the (widely used) eigenvector solution is not, in some cases, efficient, thus its use in practice may be questionable.
منابع مشابه
Combined Data Envelopment Analysis and Analytical Hierarchy Process Methods to obtain the Favorable Weights from Pairwise Comparison Matrix
متن کامل
A Common Weight Multi-criteria Decision analysis-data Envelopment Analysis Approach with Assurance Region for Weight Derivation from Pairwise Comparison Matrices
Deriving weights from a pairwise comparison matrix (PCM) is a subject for which a wide range of methods have ever been presented. This paper proposes a common weight multi criteria decision analysis-data envelopment analysis (MCDA-DEA) approach with assurance region for weight derivation from a PCM. The proposed model has several merits over the competing approaches and removes the drawbacks of...
متن کاملA note on deriving weights from pairwise comparison ratio matrices
This paper addresses the Cook and Kress method regarding the use of mathematical programming to derive weights from pairwise comparison ratio matrices. We note that the Cook and Kress formulation has the shortcoming that alternative optimal solutions may occur, which would lead to an infinite set of possible weights. This paper proposes to resolve the problem by formulating a Phase II optimizat...
متن کاملPairwise choice as a simple and robust method for inferring ranking data
One of the largest challenges for a recommender system is building a ranking of “quality” or “relevance” in situations where these features cannot be observed directly. These models are often trained on various types of survey data, including Likert-scale quality ratings or pairwise comparison surveys, but there has been little work detailing the efficiency of these techniques for eliciting qua...
متن کاملA note on "A new approach for weight derivation using data envelopment analysis in the analytic hierarchy process"
DEAHP as a weight derivation procedure for analytic hierarchy process (AHP) has been found suffering from some significant drawbacks. Recently, Mirhedayatian and Saen (2011) [5] proposed a new procedure entitled Revised DEAHP for AHP weight derivation [S.M. Mirhedayatian, R.F. Saen, A new approach for weight derivation using data envelopment analysis in the analytic hierarchy process, Journal o...
متن کامل